Multiplication over Fpm on FPGA: A Survey
نویسندگان
چکیده
This paper aims at comparing multiplication algorithms over Fpm on FPGA. Contrary to previous surveys providing the reader with an estimate of both area and delay in terms of XOR gates, we discuss placeand-route results which point out that the choice of an algorithm depends on the irreducible polynomial and on some architectural parameters. We designed a VHDL code generator to easily study a wide range of algorithms and parameters.
منابع مشابه
An Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملMatrix-product structure of repeated-root constacyclic codes over finite fields
For any prime number p, positive integers m, k, n satisfying gcd(p, n) = 1 and λ0 ∈ F × pm, we prove that any λ p 0 -constacyclic code of length p n over the finite field Fpm is monomially equivalent to a matrix-product code of a nested sequence of p λ0-constacyclic codes with length n over Fpm.
متن کاملMatrix-product structure of constacyclic codes over finite chain rings $\mathbb{F}_{p^m}[u]/\langle u^e\rangle$
Let m, e be positive integers, p a prime number, Fpm be a finite field of p elements and R = Fpm [u]/〈u 〉 which is a finite chain ring. For any ω ∈ R and positive integers k, n satisfying gcd(p, n) = 1, we prove that any (1+ωu)-constacyclic code of length pn over R is monomially equivalent to a matrix-product code of a nested sequence of p cyclic codes with length n over R and a p × p matrix Ap...
متن کاملFaster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p³)
In this paper we present a new method for fast scalar multiplication on el-liptic curves over GF (p) in FPGA using Edwards and twisted Edwards curves over GF (p 3). The presented solution works for curves with prime group order (for example for all NIST curves over GF (p)). It is possible because of using 2-isogenous twisted Edwards curves over GF (p 3) instead of using short Weierstrass curves...
متن کاملDesign, Analysis, and FPGA prototyping of High-Performance Arithmetic for Cryptographic Applications Literature Review - Part 1: Cryptographic Algorithms
This report presents a brief survey on secret key and public key cryptography algorithms. These include: block ciphers, stream ciphers, RSA, ElGamal and Elliptic Curve Cryptosystems (ECC). Since ECC achieved security levels comparable to those of traditional public key cryptosystems using smaller keys (160 bits), this work focus more on ECC. Finally, this work also presents a survey on scalar m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007